Fibonacci Integers
نویسندگان
چکیده
A Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77 = 21 · 55/(3 · 5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(log x) − (log x)) and exp ( c(log x) + (log x) )
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملFibonacci Expansions and "f-adic" Integers
A Fibonacci expansion of a nonnegative integer n is an expression of n as a sum of Fibonacci numbers Fk with k > 2. It may be thought of as a partition of n into Fibonacci parts. The most commonly studied such expansion is the unique one in which the parts are all distinct and no two consecutive Fibonacci numbers appear. C. G. Lekkerkerker first showed this expansion was unique in 1952 [5]. The...
متن کاملConditions for the Existence of Generalized Fibonacci Primitive Roots
Consider sequences of integers {Un}TM=0 defined by U„ = aUn_x +bUn_2 for all integers n > 2, where U0 = 0, C/j = 1, a and b are given integers. We call these sequences generalized Fibonacci sequences with parameters a and b. In the case where a = b = 1, the sequence {Un}TM=0 is called the Fibonacci sequence, and we denote its terms by F0,Fl9.... The polynomial f(x) = x-ax-h with discriminant D ...
متن کاملOn the Growth Rate of Generalized Fibonacci Numbers
for all nonnegative integers i, j such that j ≤ i, as illustrated in Figure 1.1. The points in R2 associated with ( i j ) , ( i+1 j ) , and ( i+1 j+1 ) form a unit equilateral triangle. This arrayal is called the natural arrayal of Pascal’s triangle in R2. For all t ∈ R : −√3 < t < √3 and nonnegative integers k, define k(t) to be the sum of all binomial coefficients associated with points in R2...
متن کاملInitial Digits in Number Theory
1. J. C. Butcher. "On a Conjecture Concerning a Set of Sequences Satisfying The Fibonacci Difference Equation/ The Fibonacci Quarterly 16 (1978):8183. 2. M. D. Hendy, "Stolarskys Distribution of Positive Integers." The Fibonacci Quarterly 16 (1978)2 70-80. 3. V. E. HoggattsJr. Fibonacci and Lucas Numbers* Boston: Houghton Mifflin9 1969. Pp. 34-35. 4. K. Stolarsky. "A Set of Generalized Fibonacc...
متن کامل